Bounded-reversal multihead finite automata languages
نویسندگان
چکیده
منابع مشابه
Path-Bounded One-Way Multihead Finite Automata
For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head f...
متن کاملOn Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملNondeterminism is essential for reversal-bounded two-way multihead finite automata
It is proved for some "nice" function / that/(fl)-reversal-bounded two-way nondeterministic finite automata are more powerful than /(n)-reversal-bounded two-way deterministic ones. This solves a simplified extension of the well-known DLOG ? NLOG problem.
متن کاملConnections among Space-bounded and Multihead Probabilistic Automata
We show that the heads of multihead unbounded-error or bounded-error or one-sided-error probabilistic nite automata are equivalent alternatives to the storage tapes of the corresponding probabilistic Turing machines (Theorem 1). These results parallel the classic ones concerning deterministic and nondeterministic automata. Several important properties of logarithmic-space (nondeterministic and ...
متن کاملOne-Reversal Counter Machines and Multihead Automata: Revisited
We investigate the power of (1-reversal) counter machines (finite automata with multiple counters, where each counter can ‘‘reverse’’ only once, i.e., once a counter decrements, it can no longer increment) and one-way multihead finite automata (finite automata with multiple one-way input heads) as a language acceptor. They can be non-deterministic as well as augmented with a pushdown stack. Fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)90994-2